On the Practicality of Abductive Validation

نویسنده

  • Tim Menzies
چکیده

An abductive framework is described for validating theories using a library of known or desired behaviour. Abduction is known to be NP-hard which suggests that this framework is impractical for anything other than small theories. The computational limits of the framework is therefore explored. We find that abductive validation is a practical tool for the KBS we see in contemporary practice.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lower Bounds on the Size of Test Data Sets

Practically speaking, how small can a test suite be and still be of value? In the context of temporal graph-theoretic abductive validation, the answer to this question is very language-dependent. Seemingly trivial variations in a language can have a signiicant impact on how large a test suite must be. This paper is hence a cautionary note to those who invent languages and ontologies without exp...

متن کامل

A Graph Theoretic Optimisation of Temporal Abductive Validation

Abductive validation for a theory T expressed in language LQCM is known to be exponential. Despite this, abductive validation over LQCM using the HT4 abductive inference engine is a useful technique for a large range of real-world theories. However, doubts persist about LTQCM: a time-based variant of LQCM. In LTQCM, abductive validation is executed for for theories used in long time-based simul...

متن کامل

On the abductive or deductive nature of database schema validation and update processing problems

We show that database schema validation and update processing problems such as view updating, materialized view maintenance, integrity constraint checking, integrity constraint maintenance or condition monitoring can be classified as problems of either abductive or deductive nature, according to the reasoning paradigm that inherently suites them. This is done by performing abductive and deducti...

متن کامل

\And" Can You Validate It?

We advocate changing a language if that language cannot support validation. To this end, we are exploring the computational cost of basic language constructs within our abductive validation framework. Conjunction is found to decrease the computational cost of validation for theories 5 that are not used for time-based simulation purposes. However, in the case of time-based simulations, the use o...

متن کامل

cient and Practical Diagnosis

The task of diagnosis, a typical abductive problem, is to nd a hypothesis that best explains a set of observations. Generally, a neural network diagnostic reasoning model nds only one hypothesis to a set of observations. It is computationally expensive to nd the hypothesis because the number of the potential hypotheses is exponentially large. Recently, we have proposed a connectionist diagnosis...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996